-
1 алгоритм метода ветвей и границ
1) Engineering: branch-and-bound algorithm2) Information technology: branch and bounds algorithm, branch-bound algorithm3) Microelectronics: branch and bound algorithmУниверсальный русско-английский словарь > алгоритм метода ветвей и границ
-
2 нарушение установленных границ
Русско-английский большой базовый словарь > нарушение установленных границ
-
3 метод ветвей и границ
Русско-английский новый политехнический словарь > метод ветвей и границ
-
4 верхняя граница
1. upper bound2. high bound -
5 метод ветвей и границ
1) Computers: branch and bound algorithm2) Engineering: branch and bound method3) Mathematics: branch-and-bound principle, branch-and-bound procedure4) Economy: branch-and-bound method5) Information technology: branch and bounds method6) Household appliances: branch-and-bound7) Makarov: branch and bound algorithm (метод оптимизации)Универсальный русско-английский словарь > метод ветвей и границ
-
6 отказоопасная граница
Русско-английский большой базовый словарь > отказоопасная граница
-
7 переходящий все границы
Русско-английский большой базовый словарь > переходящий все границы
-
8 верхняя граница
верхнее значение; значение на верхней границе — high value
Русско-английский новый политехнический словарь > верхняя граница
-
9 переходит все границы
Русско-английский большой базовый словарь > переходит все границы
-
10 доверительная граница
1. confidence bound2. confidence limitsРусско-английский большой базовый словарь > доверительная граница
См. также в других словарях:
Branch and bound — (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Viterbi decoder — A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been encoded using forward error correction based on a convolutional code. There are other algorithms for decoding a convolutionally encoded stream (for example, the… … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… … Wikipedia
Riemann hypothesis — The real part (red) and imaginary part (blue) of the Riemann zeta function along the critical line Re(s) = 1/2. The first non trivial zeros can be seen at Im(s) = ±14.135, ±21.022 and ±25.011 … Wikipedia
Riemann zeta function — ζ(s) in the complex plane. The color of a point s encodes the value of ζ(s): dark colors denote values close to zero and hue encodes the value s argument. The white spot at s = 1 is the pole of the zeta function; the black spots on the… … Wikipedia